Diagnostic Information for Realizability
نویسندگان
چکیده
Realizability – checking whether a specification can be implemented by an open system – is a fundamental step in the design flow. However, if the specification turns out not to be realizable, there is no method to pinpoint the causes for unrealizability. In this paper, we address the open problem of providing diagnostic information for realizability: we formally define the notion of (minimal) explanation of (un)realizability, we propose algorithms to compute such explanations, and provide a preliminary experimental evaluation.
منابع مشابه
Proving Properties of Typed Lambda-Terms Using Realizability, Covers, and Sheaves (Preliminary Version)
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative structures. These structures need not be extensional. In this framework, a g...
متن کاملStudy about Realizability Situation and Utilization Contexts of Water Sensitive Urban Design
Climate changes, failure to complete the natural cycle of water in the city due to unsustainableconstruction of the urban environments and increase of impervious surfaces, lack of nutrition of undergroundaquifer in the cities, unsustainable management of stormwater and the floods due to them in the periods of rainfallcaused to provide an approach that is called water sensitive urban design. Thi...
متن کاملA hybrid-optimization method for assessing the realizability of wireframe sketches
This paper introduces an optimization strategy for evaluating the realizability of a 2D wireframe sketch that conveys geometric and topological information about a 3D solid model. Applying the cross-section realizability criterion, one is able to assert whether a wireframe sketch is a true orthogonal projection of a 3D-solid. In this work, we first review current sketch interpretation methods a...
متن کاملRealizability, Covers, and Sheaves II. Applications to the Second-Order Lambda-Calculus
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory, a cover algebra being a Grothendieck topology in the case of a preorder). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative str...
متن کاملRealizing arithmetical formulæ
Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008